Algorithms for pattern matching and discovery in RNA secondary structure

Algorithms for pattern matching and discovery in RNA secondary structure

Text-indexing structures provide significant advantages in the solution of many problems related to string analysis and comparison, and are nowadays widely used in the analysis of biological sequences. In this paper, we present some applications of affix trees to problems of exact and approximate pattern matching and discovery in RNA sequences. By allowing bidirectional search for symmetric pat...

Exact Pattern Matching for RNA Secondary Structures

Pattern Matching and Pattern Discovery Algorithms for Protein Topologies

We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maxi...

Exact Pattern Matching for RNA Structure Ensembles

ExpaRNA’s core algorithm computes, for two fixed RNA structures, a maximal non-overlapping set of maximal exact matchings. We introduce an algorithm ExpaRNA-P that solves the lifted problem of finding such sets of exact matchings in entire Boltzmann-distributed structure ensembles of two RNAs. Due to a novel kind of structural sparsification, the new algorithm maintains the time and space compl...

RNA Secondary Structure Prediction Algorithms

RNA secondary structure prediction is an important problem studied extensively in the past three dacades. However, pseudoknots are usually excluded in RNA secondary structure prediction due to the hardness of examining all possible structures efficiently and model the energy correctly. Current algorithms on predicting structures with pseudoknots usually have extremely high resource requirements...